Theoretical analysis of steady state genetic algorithms

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Steady State Analysis of Nanofuel Droplet ‎Evaporation

The potential for nanofuels as one of the clean sources of energy on account of its enhanced combustion performance coupled with low emissions has been established. Considering the importance of the fuel evaporation phase in the entire combustion process, this work presents an attempt at applying the steady state analysis equations to nanofuel experimental data obtained from the li...

متن کامل

Continuous Dynamical System Models of Steady-State Genetic Algorithms

This paper constructs discrete-time and continuous-time dynamical system expected value and infinite population models for steady-state genetic and evolutionary search algorithms. Conditions are given under which the discrete-time expected value models converge to the continuous-time models as the population size goes to infinity. Existence and uniqueness theorems are proved for solutions of th...

متن کامل

Replacement Strategies in Steady State Genetic Algorithms: Static Environments

This paper investigates the effects of a number of replacement strategies for use in steady state genetic algorithms. Some of these (deleting the oldest, worst or random members, or deletion by “Kill Tournament”) are well known from the literature. The last, “conservative” replacement was developed for use in timevarying problems and combines a Replace–Oldest strategy with modified selection to...

متن کامل

An Adaptive Penalty Scheme for Steady-State Genetic Algorithms

A parameter-less adaptive penalty scheme for steady-state genetic algorithms applied to constrained optimization problems is proposed. For each constraint, a penalty parameter is adaptively computed along the run according to information extracted from the current population such as the existence of feasible individuals and the level of violation of each constraint. Using real coding, rank-base...

متن کامل

Constrained Multi-objective Optimization Using Steady State Genetic Algorithms

In this paper we propose two novel approaches for solving constrained multi-objective optimization problems using steady state GAs. These methods are intended for solving real-world application problems that have many constraints and very small feasible regions. One method called Objective Exchange Genetic Algorithm for Design Optimization (OEGADO) runs several GAs concurrently with each GA opt...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applications of Mathematics

سال: 2014

ISSN: 0862-7940,1572-9109

DOI: 10.1007/s10492-014-0069-z